-colored kernels
نویسندگان
چکیده
منابع مشابه
K-colored Kernels
We study k-colored kernels in m-colored digraphs. An m-colored digraph D has k-colored kernel if there exists a subset K of its vertices such that (i) from every vertex v / ∈ K there exists an at most k-colored directed path from v to a vertex of K and (ii) for every u, v ∈ K there does not exist an at most k-colored directed path between them. In this paper, we prove that for every integer k ≥...
متن کاملKernels and cycles' subdivisions in arc-colored tournaments
Let D be a digraph. D is said to be an m-colored digraph if the arcs of D are colored with m colors. A path P in D is called monochromatic if all of its arcs are colored alike. Let D be an m-colored digraph. A set N ⊆ V (D) is said to be a kernel by monochromatic paths of D if it satisfies the following conditions: a) for every pair of different vertices u, v ∈ N there is no monochromatic direc...
متن کاملCharacterization of factors underlying the metabolic shifts in developing kernels of colored maize
Elucidation of the metabolic pathways determining pigmentation and their underlying regulatory mechanisms in maize kernels is of high importance in attempts to improve the nutritional composition of our food. In this study, we compared dynamics in the transcriptome and metabolome between colored SW93 and white SW48 by integrating RNA-Seq and non-targeted metabolomics. Our data revealed that exp...
متن کاملAbsorbent sets and kernels by monochromatic directed paths in m-colored tournaments
In this paper, we consider the following problem due to Erdős: for each m ∈ N, is there a (least) positive integer f(m) so that every finite mcolored tournament contains an absorbent set S by monochromatic directed paths of f(m) vertices? In particular, is f(3) = 3? We prove several bounds for absorbent sets of m-colored tournaments under certain conditions on the number of colors of the arcs i...
متن کاملKernels by Monochromatic Directed Paths In m-Colored Digraphs With Quasi-Transitive Chromatic Classes
In this paper, we give sufficient conditions for the existence of kernels by monochromatic directed paths (m.d.p.) in digraphs with quasi-transitive colorings. Let D be an m-colored digraph. We prove that if every chromatic class of D is quasi-transitive, every cycle is quasitransitive in the rim and D does not contain polychromatic triangles, then D has a kernel by m.d.p. The same result is va...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2012
ISSN: 0166-218X
DOI: 10.1016/j.dam.2012.04.019